P = Np, up to Sharing
نویسنده
چکیده
We prove that we may compute the normal form of each term of the simply typed-calculus in a polynomial number of sharable reductions (where the notion of sharing is L evy's \optimal" one). As a simple corollary, we get that P = NP \up to sharing", i.e. up to the computational overhead due to sharing.
منابع مشابه
High-performance and Low-power Clock Branch Sharing Pseudo-NMOS Level Converting Flip-flop
Multi-Supply voltage design using Cluster Voltage Scaling (CVS) is an effective way to reduce power consumption without performance degradation. One of the major issues in this method is performance and power overheads due to insertion of Level Converting Flip-Flops (LCFF) at the interface from low-supply to high-supply clusters to simultaneously perform latching and level conversion. In this p...
متن کاملBiochemical and morphological changes in bone marrow mesenchymal stem cells induced by treatment of rats with p-Nonylphenol
Objective(s):In previous investigations, we have shown para-nonylphenol (p-NP) caused significant reduction of proliferation and differentiation of rat bone marrow mesenchymal stem cells (MSCs) in vitro. In this study, we first treat the rats with p-NP, then carried out the biochemical and morphological studies on MSCs. Materials and Methods: Proliferation property of cells was evaluated with t...
متن کاملOn Approximating the Maximum Simple Sharing Problem
In the maximum simple sharing problem (MSS), we want to compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the graph, with the constraint that all paths have both endpoints in the other layer. This is a variation of the maximum sharing problem (MS) that finds important applications in the design of molecular quantum-do...
متن کاملA Model for Evaluating Knowledge Sharing Using Fuzzy Inference System (Case Study: Tehran Municipality ICT Organization)
The present paper aimed at developing an approach based on Fuzzy Inference System (FIS) for measuring of knowledge sharing in the organization. In recent years there has been increasing interest in the knowledge sharing by experts and managers in the world, according to increasing importance of knowledge as the key source of competitive advantage, organizations have made serious effort to find ...
متن کاملAn Optimal Share Transfer Problem on Secret Sharing Storage Systems
We have been developing a secure and reliable distributed storage system, which uses a secret sharing scheme. In order to efficiently store data in the system, this paper introduces an optimal share transfer problem, and proves it to be, generally, NP-hard. It is also shown that the problem can be resolved into a Steiner tree problem. Finally, through computational experiments we perform the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007